<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Copyright (C) 2007 The Guava Authors<a name="line.2"></a>
<span class="sourceLineNo">003</span> *<a name="line.3"></a>
<span class="sourceLineNo">004</span> * Licensed under the Apache License, Version 2.0 (the "License");<a name="line.4"></a>
<span class="sourceLineNo">005</span> * you may not use this file except in compliance with the License.<a name="line.5"></a>
<span class="sourceLineNo">006</span> * You may obtain a copy of the License at<a name="line.6"></a>
<span class="sourceLineNo">007</span> *<a name="line.7"></a>
<span class="sourceLineNo">008</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.8"></a>
<span class="sourceLineNo">009</span> *<a name="line.9"></a>
<span class="sourceLineNo">010</span> * Unless required by applicable law or agreed to in writing, software<a name="line.10"></a>
<span class="sourceLineNo">011</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.11"></a>
<span class="sourceLineNo">012</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.12"></a>
<span class="sourceLineNo">013</span> * See the License for the specific language governing permissions and<a name="line.13"></a>
<span class="sourceLineNo">014</span> * limitations under the License.<a name="line.14"></a>
<span class="sourceLineNo">015</span> */<a name="line.15"></a>
<span class="sourceLineNo">016</span><a name="line.16"></a>
<span class="sourceLineNo">017</span>package com.google.common.collect;<a name="line.17"></a>
<span class="sourceLineNo">018</span><a name="line.18"></a>
<span class="sourceLineNo">019</span>import static com.google.common.base.Preconditions.checkArgument;<a name="line.19"></a>
<span class="sourceLineNo">020</span>import static com.google.common.base.Preconditions.checkState;<a name="line.20"></a>
<span class="sourceLineNo">021</span><a name="line.21"></a>
<span class="sourceLineNo">022</span>import com.google.common.annotations.GwtCompatible;<a name="line.22"></a>
<span class="sourceLineNo">023</span>import com.google.common.annotations.GwtIncompatible;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import com.google.common.base.Objects;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import com.google.common.primitives.Ints;<a name="line.25"></a>
<span class="sourceLineNo">026</span><a name="line.26"></a>
<span class="sourceLineNo">027</span>import java.io.IOException;<a name="line.27"></a>
<span class="sourceLineNo">028</span>import java.io.ObjectInputStream;<a name="line.28"></a>
<span class="sourceLineNo">029</span>import java.io.ObjectOutputStream;<a name="line.29"></a>
<span class="sourceLineNo">030</span>import java.io.Serializable;<a name="line.30"></a>
<span class="sourceLineNo">031</span>import java.util.Comparator;<a name="line.31"></a>
<span class="sourceLineNo">032</span>import java.util.ConcurrentModificationException;<a name="line.32"></a>
<span class="sourceLineNo">033</span>import java.util.Iterator;<a name="line.33"></a>
<span class="sourceLineNo">034</span>import java.util.NavigableSet;<a name="line.34"></a>
<span class="sourceLineNo">035</span>import java.util.NoSuchElementException;<a name="line.35"></a>
<span class="sourceLineNo">036</span><a name="line.36"></a>
<span class="sourceLineNo">037</span>import javax.annotation.Nullable;<a name="line.37"></a>
<span class="sourceLineNo">038</span><a name="line.38"></a>
<span class="sourceLineNo">039</span>/**<a name="line.39"></a>
<span class="sourceLineNo">040</span> * A multiset which maintains the ordering of its elements, according to either their natural order<a name="line.40"></a>
<span class="sourceLineNo">041</span> * or an explicit {@link Comparator}. In all cases, this implementation uses<a name="line.41"></a>
<span class="sourceLineNo">042</span> * {@link Comparable#compareTo} or {@link Comparator#compare} instead of {@link Object#equals} to<a name="line.42"></a>
<span class="sourceLineNo">043</span> * determine equivalence of instances.<a name="line.43"></a>
<span class="sourceLineNo">044</span> *<a name="line.44"></a>
<span class="sourceLineNo">045</span> * &lt;p&gt;&lt;b&gt;Warning:&lt;/b&gt; The comparison must be &lt;i&gt;consistent with equals&lt;/i&gt; as explained by the<a name="line.45"></a>
<span class="sourceLineNo">046</span> * {@link Comparable} class specification. Otherwise, the resulting multiset will violate the<a name="line.46"></a>
<span class="sourceLineNo">047</span> * {@link java.util.Collection} contract, which is specified in terms of {@link Object#equals}.<a name="line.47"></a>
<span class="sourceLineNo">048</span> *<a name="line.48"></a>
<span class="sourceLineNo">049</span> * &lt;p&gt;See the Guava User Guide article on &lt;a href=<a name="line.49"></a>
<span class="sourceLineNo">050</span> * "http://code.google.com/p/guava-libraries/wiki/NewCollectionTypesExplained#Multiset"&gt;<a name="line.50"></a>
<span class="sourceLineNo">051</span> * {@code Multiset}&lt;/a&gt;.<a name="line.51"></a>
<span class="sourceLineNo">052</span> *<a name="line.52"></a>
<span class="sourceLineNo">053</span> * @author Louis Wasserman<a name="line.53"></a>
<span class="sourceLineNo">054</span> * @author Jared Levy<a name="line.54"></a>
<span class="sourceLineNo">055</span> * @since 2.0 (imported from Google Collections Library)<a name="line.55"></a>
<span class="sourceLineNo">056</span> */<a name="line.56"></a>
<span class="sourceLineNo">057</span>@GwtCompatible(emulated = true)<a name="line.57"></a>
<span class="sourceLineNo">058</span>public final class TreeMultiset&lt;E&gt; extends AbstractSortedMultiset&lt;E&gt; implements Serializable {<a name="line.58"></a>
<span class="sourceLineNo">059</span><a name="line.59"></a>
<span class="sourceLineNo">060</span>  /**<a name="line.60"></a>
<span class="sourceLineNo">061</span>   * Creates a new, empty multiset, sorted according to the elements' natural order. All elements<a name="line.61"></a>
<span class="sourceLineNo">062</span>   * inserted into the multiset must implement the {@code Comparable} interface. Furthermore, all<a name="line.62"></a>
<span class="sourceLineNo">063</span>   * such elements must be &lt;i&gt;mutually comparable&lt;/i&gt;: {@code e1.compareTo(e2)} must not throw a<a name="line.63"></a>
<span class="sourceLineNo">064</span>   * {@code ClassCastException} for any elements {@code e1} and {@code e2} in the multiset. If the<a name="line.64"></a>
<span class="sourceLineNo">065</span>   * user attempts to add an element to the multiset that violates this constraint (for example,<a name="line.65"></a>
<span class="sourceLineNo">066</span>   * the user attempts to add a string element to a set whose elements are integers), the<a name="line.66"></a>
<span class="sourceLineNo">067</span>   * {@code add(Object)} call will throw a {@code ClassCastException}.<a name="line.67"></a>
<span class="sourceLineNo">068</span>   *<a name="line.68"></a>
<span class="sourceLineNo">069</span>   * &lt;p&gt;The type specification is {@code &lt;E extends Comparable&gt;}, instead of the more specific<a name="line.69"></a>
<span class="sourceLineNo">070</span>   * {@code &lt;E extends Comparable&lt;? super E&gt;&gt;}, to support classes defined without generics.<a name="line.70"></a>
<span class="sourceLineNo">071</span>   */<a name="line.71"></a>
<span class="sourceLineNo">072</span>  public static &lt;E extends Comparable&gt; TreeMultiset&lt;E&gt; create() {<a name="line.72"></a>
<span class="sourceLineNo">073</span>    return new TreeMultiset&lt;E&gt;(Ordering.natural());<a name="line.73"></a>
<span class="sourceLineNo">074</span>  }<a name="line.74"></a>
<span class="sourceLineNo">075</span><a name="line.75"></a>
<span class="sourceLineNo">076</span>  /**<a name="line.76"></a>
<span class="sourceLineNo">077</span>   * Creates a new, empty multiset, sorted according to the specified comparator. All elements<a name="line.77"></a>
<span class="sourceLineNo">078</span>   * inserted into the multiset must be &lt;i&gt;mutually comparable&lt;/i&gt; by the specified comparator:<a name="line.78"></a>
<span class="sourceLineNo">079</span>   * {@code comparator.compare(e1,<a name="line.79"></a>
<span class="sourceLineNo">080</span>   * e2)} must not throw a {@code ClassCastException} for any elements {@code e1} and {@code e2} in<a name="line.80"></a>
<span class="sourceLineNo">081</span>   * the multiset. If the user attempts to add an element to the multiset that violates this<a name="line.81"></a>
<span class="sourceLineNo">082</span>   * constraint, the {@code add(Object)} call will throw a {@code ClassCastException}.<a name="line.82"></a>
<span class="sourceLineNo">083</span>   *<a name="line.83"></a>
<span class="sourceLineNo">084</span>   * @param comparator<a name="line.84"></a>
<span class="sourceLineNo">085</span>   *          the comparator that will be used to sort this multiset. A null value indicates that<a name="line.85"></a>
<span class="sourceLineNo">086</span>   *          the elements' &lt;i&gt;natural ordering&lt;/i&gt; should be used.<a name="line.86"></a>
<span class="sourceLineNo">087</span>   */<a name="line.87"></a>
<span class="sourceLineNo">088</span>  @SuppressWarnings("unchecked")<a name="line.88"></a>
<span class="sourceLineNo">089</span>  public static &lt;E&gt; TreeMultiset&lt;E&gt; create(@Nullable Comparator&lt;? super E&gt; comparator) {<a name="line.89"></a>
<span class="sourceLineNo">090</span>    return (comparator == null)<a name="line.90"></a>
<span class="sourceLineNo">091</span>        ? new TreeMultiset&lt;E&gt;((Comparator) Ordering.natural())<a name="line.91"></a>
<span class="sourceLineNo">092</span>        : new TreeMultiset&lt;E&gt;(comparator);<a name="line.92"></a>
<span class="sourceLineNo">093</span>  }<a name="line.93"></a>
<span class="sourceLineNo">094</span><a name="line.94"></a>
<span class="sourceLineNo">095</span>  /**<a name="line.95"></a>
<span class="sourceLineNo">096</span>   * Creates an empty multiset containing the given initial elements, sorted according to the<a name="line.96"></a>
<span class="sourceLineNo">097</span>   * elements' natural order.<a name="line.97"></a>
<span class="sourceLineNo">098</span>   *<a name="line.98"></a>
<span class="sourceLineNo">099</span>   * &lt;p&gt;This implementation is highly efficient when {@code elements} is itself a {@link Multiset}.<a name="line.99"></a>
<span class="sourceLineNo">100</span>   *<a name="line.100"></a>
<span class="sourceLineNo">101</span>   * &lt;p&gt;The type specification is {@code &lt;E extends Comparable&gt;}, instead of the more specific<a name="line.101"></a>
<span class="sourceLineNo">102</span>   * {@code &lt;E extends Comparable&lt;? super E&gt;&gt;}, to support classes defined without generics.<a name="line.102"></a>
<span class="sourceLineNo">103</span>   */<a name="line.103"></a>
<span class="sourceLineNo">104</span>  public static &lt;E extends Comparable&gt; TreeMultiset&lt;E&gt; create(Iterable&lt;? extends E&gt; elements) {<a name="line.104"></a>
<span class="sourceLineNo">105</span>    TreeMultiset&lt;E&gt; multiset = create();<a name="line.105"></a>
<span class="sourceLineNo">106</span>    Iterables.addAll(multiset, elements);<a name="line.106"></a>
<span class="sourceLineNo">107</span>    return multiset;<a name="line.107"></a>
<span class="sourceLineNo">108</span>  }<a name="line.108"></a>
<span class="sourceLineNo">109</span><a name="line.109"></a>
<span class="sourceLineNo">110</span>  private final transient Reference&lt;AvlNode&lt;E&gt;&gt; rootReference;<a name="line.110"></a>
<span class="sourceLineNo">111</span>  private final transient GeneralRange&lt;E&gt; range;<a name="line.111"></a>
<span class="sourceLineNo">112</span>  private final transient AvlNode&lt;E&gt; header;<a name="line.112"></a>
<span class="sourceLineNo">113</span><a name="line.113"></a>
<span class="sourceLineNo">114</span>  TreeMultiset(Reference&lt;AvlNode&lt;E&gt;&gt; rootReference, GeneralRange&lt;E&gt; range, AvlNode&lt;E&gt; endLink) {<a name="line.114"></a>
<span class="sourceLineNo">115</span>    super(range.comparator());<a name="line.115"></a>
<span class="sourceLineNo">116</span>    this.rootReference = rootReference;<a name="line.116"></a>
<span class="sourceLineNo">117</span>    this.range = range;<a name="line.117"></a>
<span class="sourceLineNo">118</span>    this.header = endLink;<a name="line.118"></a>
<span class="sourceLineNo">119</span>  }<a name="line.119"></a>
<span class="sourceLineNo">120</span><a name="line.120"></a>
<span class="sourceLineNo">121</span>  TreeMultiset(Comparator&lt;? super E&gt; comparator) {<a name="line.121"></a>
<span class="sourceLineNo">122</span>    super(comparator);<a name="line.122"></a>
<span class="sourceLineNo">123</span>    this.range = GeneralRange.all(comparator);<a name="line.123"></a>
<span class="sourceLineNo">124</span>    this.header = new AvlNode&lt;E&gt;(null, 1);<a name="line.124"></a>
<span class="sourceLineNo">125</span>    successor(header, header);<a name="line.125"></a>
<span class="sourceLineNo">126</span>    this.rootReference = new Reference&lt;AvlNode&lt;E&gt;&gt;();<a name="line.126"></a>
<span class="sourceLineNo">127</span>  }<a name="line.127"></a>
<span class="sourceLineNo">128</span><a name="line.128"></a>
<span class="sourceLineNo">129</span>  // GWT inherits the default, SortedSet-returning AbstractSortedMultiset impl<a name="line.129"></a>
<span class="sourceLineNo">130</span>  @GwtIncompatible("Navigable")<a name="line.130"></a>
<span class="sourceLineNo">131</span>  @Override<a name="line.131"></a>
<span class="sourceLineNo">132</span>  public NavigableSet&lt;E&gt; elementSet() {<a name="line.132"></a>
<span class="sourceLineNo">133</span>    return (NavigableSet&lt;E&gt;) super.elementSet();<a name="line.133"></a>
<span class="sourceLineNo">134</span>  }<a name="line.134"></a>
<span class="sourceLineNo">135</span><a name="line.135"></a>
<span class="sourceLineNo">136</span>  // GWT inherits the default, SortedSet-returning AbstractSortedMultiset impl<a name="line.136"></a>
<span class="sourceLineNo">137</span>  @GwtIncompatible("Navigable")<a name="line.137"></a>
<span class="sourceLineNo">138</span>  @Override<a name="line.138"></a>
<span class="sourceLineNo">139</span>  NavigableSet&lt;E&gt; createElementSet() {<a name="line.139"></a>
<span class="sourceLineNo">140</span>    return new SortedMultisets.NavigableElementSet&lt;E&gt;(this);<a name="line.140"></a>
<span class="sourceLineNo">141</span>  }<a name="line.141"></a>
<span class="sourceLineNo">142</span><a name="line.142"></a>
<span class="sourceLineNo">143</span>  /**<a name="line.143"></a>
<span class="sourceLineNo">144</span>   * A function which can be summed across a subtree.<a name="line.144"></a>
<span class="sourceLineNo">145</span>   */<a name="line.145"></a>
<span class="sourceLineNo">146</span>  private enum Aggregate {<a name="line.146"></a>
<span class="sourceLineNo">147</span>    SIZE {<a name="line.147"></a>
<span class="sourceLineNo">148</span>      @Override<a name="line.148"></a>
<span class="sourceLineNo">149</span>      int nodeAggregate(AvlNode&lt;?&gt; node) {<a name="line.149"></a>
<span class="sourceLineNo">150</span>        return node.elemCount;<a name="line.150"></a>
<span class="sourceLineNo">151</span>      }<a name="line.151"></a>
<span class="sourceLineNo">152</span><a name="line.152"></a>
<span class="sourceLineNo">153</span>      @Override<a name="line.153"></a>
<span class="sourceLineNo">154</span>      long treeAggregate(@Nullable AvlNode&lt;?&gt; root) {<a name="line.154"></a>
<span class="sourceLineNo">155</span>        return (root == null) ? 0 : root.totalCount;<a name="line.155"></a>
<span class="sourceLineNo">156</span>      }<a name="line.156"></a>
<span class="sourceLineNo">157</span>    },<a name="line.157"></a>
<span class="sourceLineNo">158</span>    DISTINCT {<a name="line.158"></a>
<span class="sourceLineNo">159</span>      @Override<a name="line.159"></a>
<span class="sourceLineNo">160</span>      int nodeAggregate(AvlNode&lt;?&gt; node) {<a name="line.160"></a>
<span class="sourceLineNo">161</span>        return 1;<a name="line.161"></a>
<span class="sourceLineNo">162</span>      }<a name="line.162"></a>
<span class="sourceLineNo">163</span><a name="line.163"></a>
<span class="sourceLineNo">164</span>      @Override<a name="line.164"></a>
<span class="sourceLineNo">165</span>      long treeAggregate(@Nullable AvlNode&lt;?&gt; root) {<a name="line.165"></a>
<span class="sourceLineNo">166</span>        return (root == null) ? 0 : root.distinctElements;<a name="line.166"></a>
<span class="sourceLineNo">167</span>      }<a name="line.167"></a>
<span class="sourceLineNo">168</span>    };<a name="line.168"></a>
<span class="sourceLineNo">169</span>    abstract int nodeAggregate(AvlNode&lt;?&gt; node);<a name="line.169"></a>
<span class="sourceLineNo">170</span><a name="line.170"></a>
<span class="sourceLineNo">171</span>    abstract long treeAggregate(@Nullable AvlNode&lt;?&gt; root);<a name="line.171"></a>
<span class="sourceLineNo">172</span>  }<a name="line.172"></a>
<span class="sourceLineNo">173</span><a name="line.173"></a>
<span class="sourceLineNo">174</span>  private long aggregateForEntries(Aggregate aggr) {<a name="line.174"></a>
<span class="sourceLineNo">175</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.175"></a>
<span class="sourceLineNo">176</span>    long total = aggr.treeAggregate(root);<a name="line.176"></a>
<span class="sourceLineNo">177</span>    if (range.hasLowerBound()) {<a name="line.177"></a>
<span class="sourceLineNo">178</span>      total -= aggregateBelowRange(aggr, root);<a name="line.178"></a>
<span class="sourceLineNo">179</span>    }<a name="line.179"></a>
<span class="sourceLineNo">180</span>    if (range.hasUpperBound()) {<a name="line.180"></a>
<span class="sourceLineNo">181</span>      total -= aggregateAboveRange(aggr, root);<a name="line.181"></a>
<span class="sourceLineNo">182</span>    }<a name="line.182"></a>
<span class="sourceLineNo">183</span>    return total;<a name="line.183"></a>
<span class="sourceLineNo">184</span>  }<a name="line.184"></a>
<span class="sourceLineNo">185</span><a name="line.185"></a>
<span class="sourceLineNo">186</span>  private long aggregateBelowRange(Aggregate aggr, @Nullable AvlNode&lt;E&gt; node) {<a name="line.186"></a>
<span class="sourceLineNo">187</span>    if (node == null) {<a name="line.187"></a>
<span class="sourceLineNo">188</span>      return 0;<a name="line.188"></a>
<span class="sourceLineNo">189</span>    }<a name="line.189"></a>
<span class="sourceLineNo">190</span>    int cmp = comparator().compare(range.getLowerEndpoint(), node.elem);<a name="line.190"></a>
<span class="sourceLineNo">191</span>    if (cmp &lt; 0) {<a name="line.191"></a>
<span class="sourceLineNo">192</span>      return aggregateBelowRange(aggr, node.left);<a name="line.192"></a>
<span class="sourceLineNo">193</span>    } else if (cmp == 0) {<a name="line.193"></a>
<span class="sourceLineNo">194</span>      switch (range.getLowerBoundType()) {<a name="line.194"></a>
<span class="sourceLineNo">195</span>        case OPEN:<a name="line.195"></a>
<span class="sourceLineNo">196</span>          return aggr.nodeAggregate(node) + aggr.treeAggregate(node.left);<a name="line.196"></a>
<span class="sourceLineNo">197</span>        case CLOSED:<a name="line.197"></a>
<span class="sourceLineNo">198</span>          return aggr.treeAggregate(node.left);<a name="line.198"></a>
<span class="sourceLineNo">199</span>        default:<a name="line.199"></a>
<span class="sourceLineNo">200</span>          throw new AssertionError();<a name="line.200"></a>
<span class="sourceLineNo">201</span>      }<a name="line.201"></a>
<span class="sourceLineNo">202</span>    } else {<a name="line.202"></a>
<span class="sourceLineNo">203</span>      return aggr.treeAggregate(node.left) + aggr.nodeAggregate(node)<a name="line.203"></a>
<span class="sourceLineNo">204</span>          + aggregateBelowRange(aggr, node.right);<a name="line.204"></a>
<span class="sourceLineNo">205</span>    }<a name="line.205"></a>
<span class="sourceLineNo">206</span>  }<a name="line.206"></a>
<span class="sourceLineNo">207</span><a name="line.207"></a>
<span class="sourceLineNo">208</span>  private long aggregateAboveRange(Aggregate aggr, @Nullable AvlNode&lt;E&gt; node) {<a name="line.208"></a>
<span class="sourceLineNo">209</span>    if (node == null) {<a name="line.209"></a>
<span class="sourceLineNo">210</span>      return 0;<a name="line.210"></a>
<span class="sourceLineNo">211</span>    }<a name="line.211"></a>
<span class="sourceLineNo">212</span>    int cmp = comparator().compare(range.getUpperEndpoint(), node.elem);<a name="line.212"></a>
<span class="sourceLineNo">213</span>    if (cmp &gt; 0) {<a name="line.213"></a>
<span class="sourceLineNo">214</span>      return aggregateAboveRange(aggr, node.right);<a name="line.214"></a>
<span class="sourceLineNo">215</span>    } else if (cmp == 0) {<a name="line.215"></a>
<span class="sourceLineNo">216</span>      switch (range.getUpperBoundType()) {<a name="line.216"></a>
<span class="sourceLineNo">217</span>        case OPEN:<a name="line.217"></a>
<span class="sourceLineNo">218</span>          return aggr.nodeAggregate(node) + aggr.treeAggregate(node.right);<a name="line.218"></a>
<span class="sourceLineNo">219</span>        case CLOSED:<a name="line.219"></a>
<span class="sourceLineNo">220</span>          return aggr.treeAggregate(node.right);<a name="line.220"></a>
<span class="sourceLineNo">221</span>        default:<a name="line.221"></a>
<span class="sourceLineNo">222</span>          throw new AssertionError();<a name="line.222"></a>
<span class="sourceLineNo">223</span>      }<a name="line.223"></a>
<span class="sourceLineNo">224</span>    } else {<a name="line.224"></a>
<span class="sourceLineNo">225</span>      return aggr.treeAggregate(node.right) + aggr.nodeAggregate(node)<a name="line.225"></a>
<span class="sourceLineNo">226</span>          + aggregateAboveRange(aggr, node.left);<a name="line.226"></a>
<span class="sourceLineNo">227</span>    }<a name="line.227"></a>
<span class="sourceLineNo">228</span>  }<a name="line.228"></a>
<span class="sourceLineNo">229</span><a name="line.229"></a>
<span class="sourceLineNo">230</span>  @Override<a name="line.230"></a>
<span class="sourceLineNo">231</span>  public int size() {<a name="line.231"></a>
<span class="sourceLineNo">232</span>    return Ints.saturatedCast(aggregateForEntries(Aggregate.SIZE));<a name="line.232"></a>
<span class="sourceLineNo">233</span>  }<a name="line.233"></a>
<span class="sourceLineNo">234</span><a name="line.234"></a>
<span class="sourceLineNo">235</span>  @Override<a name="line.235"></a>
<span class="sourceLineNo">236</span>  int distinctElements() {<a name="line.236"></a>
<span class="sourceLineNo">237</span>    return Ints.saturatedCast(aggregateForEntries(Aggregate.DISTINCT));<a name="line.237"></a>
<span class="sourceLineNo">238</span>  }<a name="line.238"></a>
<span class="sourceLineNo">239</span><a name="line.239"></a>
<span class="sourceLineNo">240</span>  @Override<a name="line.240"></a>
<span class="sourceLineNo">241</span>  public int count(@Nullable Object element) {<a name="line.241"></a>
<span class="sourceLineNo">242</span>    try {<a name="line.242"></a>
<span class="sourceLineNo">243</span>      @SuppressWarnings("unchecked")<a name="line.243"></a>
<span class="sourceLineNo">244</span>      E e = (E) element;<a name="line.244"></a>
<span class="sourceLineNo">245</span>      AvlNode&lt;E&gt; root = rootReference.get();<a name="line.245"></a>
<span class="sourceLineNo">246</span>      if (!range.contains(e) || root == null) {<a name="line.246"></a>
<span class="sourceLineNo">247</span>        return 0;<a name="line.247"></a>
<span class="sourceLineNo">248</span>      }<a name="line.248"></a>
<span class="sourceLineNo">249</span>      return root.count(comparator(), e);<a name="line.249"></a>
<span class="sourceLineNo">250</span>    } catch (ClassCastException e) {<a name="line.250"></a>
<span class="sourceLineNo">251</span>      return 0;<a name="line.251"></a>
<span class="sourceLineNo">252</span>    } catch (NullPointerException e) {<a name="line.252"></a>
<span class="sourceLineNo">253</span>      return 0;<a name="line.253"></a>
<span class="sourceLineNo">254</span>    }<a name="line.254"></a>
<span class="sourceLineNo">255</span>  }<a name="line.255"></a>
<span class="sourceLineNo">256</span><a name="line.256"></a>
<span class="sourceLineNo">257</span>  @Override<a name="line.257"></a>
<span class="sourceLineNo">258</span>  public int add(@Nullable E element, int occurrences) {<a name="line.258"></a>
<span class="sourceLineNo">259</span>    checkArgument(occurrences &gt;= 0, "occurrences must be &gt;= 0 but was %s", occurrences);<a name="line.259"></a>
<span class="sourceLineNo">260</span>    if (occurrences == 0) {<a name="line.260"></a>
<span class="sourceLineNo">261</span>      return count(element);<a name="line.261"></a>
<span class="sourceLineNo">262</span>    }<a name="line.262"></a>
<span class="sourceLineNo">263</span>    checkArgument(range.contains(element));<a name="line.263"></a>
<span class="sourceLineNo">264</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.264"></a>
<span class="sourceLineNo">265</span>    if (root == null) {<a name="line.265"></a>
<span class="sourceLineNo">266</span>      comparator().compare(element, element);<a name="line.266"></a>
<span class="sourceLineNo">267</span>      AvlNode&lt;E&gt; newRoot = new AvlNode&lt;E&gt;(element, occurrences);<a name="line.267"></a>
<span class="sourceLineNo">268</span>      successor(header, newRoot, header);<a name="line.268"></a>
<span class="sourceLineNo">269</span>      rootReference.checkAndSet(root, newRoot);<a name="line.269"></a>
<span class="sourceLineNo">270</span>      return 0;<a name="line.270"></a>
<span class="sourceLineNo">271</span>    }<a name="line.271"></a>
<span class="sourceLineNo">272</span>    int[] result = new int[1]; // used as a mutable int reference to hold result<a name="line.272"></a>
<span class="sourceLineNo">273</span>    AvlNode&lt;E&gt; newRoot = root.add(comparator(), element, occurrences, result);<a name="line.273"></a>
<span class="sourceLineNo">274</span>    rootReference.checkAndSet(root, newRoot);<a name="line.274"></a>
<span class="sourceLineNo">275</span>    return result[0];<a name="line.275"></a>
<span class="sourceLineNo">276</span>  }<a name="line.276"></a>
<span class="sourceLineNo">277</span><a name="line.277"></a>
<span class="sourceLineNo">278</span>  @Override<a name="line.278"></a>
<span class="sourceLineNo">279</span>  public int remove(@Nullable Object element, int occurrences) {<a name="line.279"></a>
<span class="sourceLineNo">280</span>    checkArgument(occurrences &gt;= 0, "occurrences must be &gt;= 0 but was %s", occurrences);<a name="line.280"></a>
<span class="sourceLineNo">281</span>    if (occurrences == 0) {<a name="line.281"></a>
<span class="sourceLineNo">282</span>      return count(element);<a name="line.282"></a>
<span class="sourceLineNo">283</span>    }<a name="line.283"></a>
<span class="sourceLineNo">284</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.284"></a>
<span class="sourceLineNo">285</span>    int[] result = new int[1]; // used as a mutable int reference to hold result<a name="line.285"></a>
<span class="sourceLineNo">286</span>    AvlNode&lt;E&gt; newRoot;<a name="line.286"></a>
<span class="sourceLineNo">287</span>    try {<a name="line.287"></a>
<span class="sourceLineNo">288</span>      @SuppressWarnings("unchecked")<a name="line.288"></a>
<span class="sourceLineNo">289</span>      E e = (E) element;<a name="line.289"></a>
<span class="sourceLineNo">290</span>      if (!range.contains(e) || root == null) {<a name="line.290"></a>
<span class="sourceLineNo">291</span>        return 0;<a name="line.291"></a>
<span class="sourceLineNo">292</span>      }<a name="line.292"></a>
<span class="sourceLineNo">293</span>      newRoot = root.remove(comparator(), e, occurrences, result);<a name="line.293"></a>
<span class="sourceLineNo">294</span>    } catch (ClassCastException e) {<a name="line.294"></a>
<span class="sourceLineNo">295</span>      return 0;<a name="line.295"></a>
<span class="sourceLineNo">296</span>    } catch (NullPointerException e) {<a name="line.296"></a>
<span class="sourceLineNo">297</span>      return 0;<a name="line.297"></a>
<span class="sourceLineNo">298</span>    }<a name="line.298"></a>
<span class="sourceLineNo">299</span>    rootReference.checkAndSet(root, newRoot);<a name="line.299"></a>
<span class="sourceLineNo">300</span>    return result[0];<a name="line.300"></a>
<span class="sourceLineNo">301</span>  }<a name="line.301"></a>
<span class="sourceLineNo">302</span><a name="line.302"></a>
<span class="sourceLineNo">303</span>  @Override<a name="line.303"></a>
<span class="sourceLineNo">304</span>  public int setCount(@Nullable E element, int count) {<a name="line.304"></a>
<span class="sourceLineNo">305</span>    checkArgument(count &gt;= 0);<a name="line.305"></a>
<span class="sourceLineNo">306</span>    if (!range.contains(element)) {<a name="line.306"></a>
<span class="sourceLineNo">307</span>      checkArgument(count == 0);<a name="line.307"></a>
<span class="sourceLineNo">308</span>      return 0;<a name="line.308"></a>
<span class="sourceLineNo">309</span>    }<a name="line.309"></a>
<span class="sourceLineNo">310</span><a name="line.310"></a>
<span class="sourceLineNo">311</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.311"></a>
<span class="sourceLineNo">312</span>    if (root == null) {<a name="line.312"></a>
<span class="sourceLineNo">313</span>      if (count &gt; 0) {<a name="line.313"></a>
<span class="sourceLineNo">314</span>        add(element, count);<a name="line.314"></a>
<span class="sourceLineNo">315</span>      }<a name="line.315"></a>
<span class="sourceLineNo">316</span>      return 0;<a name="line.316"></a>
<span class="sourceLineNo">317</span>    }<a name="line.317"></a>
<span class="sourceLineNo">318</span>    int[] result = new int[1]; // used as a mutable int reference to hold result<a name="line.318"></a>
<span class="sourceLineNo">319</span>    AvlNode&lt;E&gt; newRoot = root.setCount(comparator(), element, count, result);<a name="line.319"></a>
<span class="sourceLineNo">320</span>    rootReference.checkAndSet(root, newRoot);<a name="line.320"></a>
<span class="sourceLineNo">321</span>    return result[0];<a name="line.321"></a>
<span class="sourceLineNo">322</span>  }<a name="line.322"></a>
<span class="sourceLineNo">323</span><a name="line.323"></a>
<span class="sourceLineNo">324</span>  @Override<a name="line.324"></a>
<span class="sourceLineNo">325</span>  public boolean setCount(@Nullable E element, int oldCount, int newCount) {<a name="line.325"></a>
<span class="sourceLineNo">326</span>    checkArgument(newCount &gt;= 0);<a name="line.326"></a>
<span class="sourceLineNo">327</span>    checkArgument(oldCount &gt;= 0);<a name="line.327"></a>
<span class="sourceLineNo">328</span>    checkArgument(range.contains(element));<a name="line.328"></a>
<span class="sourceLineNo">329</span><a name="line.329"></a>
<span class="sourceLineNo">330</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.330"></a>
<span class="sourceLineNo">331</span>    if (root == null) {<a name="line.331"></a>
<span class="sourceLineNo">332</span>      if (oldCount == 0) {<a name="line.332"></a>
<span class="sourceLineNo">333</span>        if (newCount &gt; 0) {<a name="line.333"></a>
<span class="sourceLineNo">334</span>          add(element, newCount);<a name="line.334"></a>
<span class="sourceLineNo">335</span>        }<a name="line.335"></a>
<span class="sourceLineNo">336</span>        return true;<a name="line.336"></a>
<span class="sourceLineNo">337</span>      } else {<a name="line.337"></a>
<span class="sourceLineNo">338</span>        return false;<a name="line.338"></a>
<span class="sourceLineNo">339</span>      }<a name="line.339"></a>
<span class="sourceLineNo">340</span>    }<a name="line.340"></a>
<span class="sourceLineNo">341</span>    int[] result = new int[1]; // used as a mutable int reference to hold result<a name="line.341"></a>
<span class="sourceLineNo">342</span>    AvlNode&lt;E&gt; newRoot = root.setCount(comparator(), element, oldCount, newCount, result);<a name="line.342"></a>
<span class="sourceLineNo">343</span>    rootReference.checkAndSet(root, newRoot);<a name="line.343"></a>
<span class="sourceLineNo">344</span>    return result[0] == oldCount;<a name="line.344"></a>
<span class="sourceLineNo">345</span>  }<a name="line.345"></a>
<span class="sourceLineNo">346</span><a name="line.346"></a>
<span class="sourceLineNo">347</span>  private Entry&lt;E&gt; wrapEntry(final AvlNode&lt;E&gt; baseEntry) {<a name="line.347"></a>
<span class="sourceLineNo">348</span>    return new Multisets.AbstractEntry&lt;E&gt;() {<a name="line.348"></a>
<span class="sourceLineNo">349</span>      @Override<a name="line.349"></a>
<span class="sourceLineNo">350</span>      public E getElement() {<a name="line.350"></a>
<span class="sourceLineNo">351</span>        return baseEntry.getElement();<a name="line.351"></a>
<span class="sourceLineNo">352</span>      }<a name="line.352"></a>
<span class="sourceLineNo">353</span><a name="line.353"></a>
<span class="sourceLineNo">354</span>      @Override<a name="line.354"></a>
<span class="sourceLineNo">355</span>      public int getCount() {<a name="line.355"></a>
<span class="sourceLineNo">356</span>        int result = baseEntry.getCount();<a name="line.356"></a>
<span class="sourceLineNo">357</span>        if (result == 0) {<a name="line.357"></a>
<span class="sourceLineNo">358</span>          return count(getElement());<a name="line.358"></a>
<span class="sourceLineNo">359</span>        } else {<a name="line.359"></a>
<span class="sourceLineNo">360</span>          return result;<a name="line.360"></a>
<span class="sourceLineNo">361</span>        }<a name="line.361"></a>
<span class="sourceLineNo">362</span>      }<a name="line.362"></a>
<span class="sourceLineNo">363</span>    };<a name="line.363"></a>
<span class="sourceLineNo">364</span>  }<a name="line.364"></a>
<span class="sourceLineNo">365</span><a name="line.365"></a>
<span class="sourceLineNo">366</span>  /**<a name="line.366"></a>
<span class="sourceLineNo">367</span>   * Returns the first node in the tree that is in range.<a name="line.367"></a>
<span class="sourceLineNo">368</span>   */<a name="line.368"></a>
<span class="sourceLineNo">369</span>  @Nullable private AvlNode&lt;E&gt; firstNode() {<a name="line.369"></a>
<span class="sourceLineNo">370</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.370"></a>
<span class="sourceLineNo">371</span>    if (root == null) {<a name="line.371"></a>
<span class="sourceLineNo">372</span>      return null;<a name="line.372"></a>
<span class="sourceLineNo">373</span>    }<a name="line.373"></a>
<span class="sourceLineNo">374</span>    AvlNode&lt;E&gt; node;<a name="line.374"></a>
<span class="sourceLineNo">375</span>    if (range.hasLowerBound()) {<a name="line.375"></a>
<span class="sourceLineNo">376</span>      E endpoint = range.getLowerEndpoint();<a name="line.376"></a>
<span class="sourceLineNo">377</span>      node = rootReference.get().ceiling(comparator(), endpoint);<a name="line.377"></a>
<span class="sourceLineNo">378</span>      if (node == null) {<a name="line.378"></a>
<span class="sourceLineNo">379</span>        return null;<a name="line.379"></a>
<span class="sourceLineNo">380</span>      }<a name="line.380"></a>
<span class="sourceLineNo">381</span>      if (range.getLowerBoundType() == BoundType.OPEN<a name="line.381"></a>
<span class="sourceLineNo">382</span>          &amp;&amp; comparator().compare(endpoint, node.getElement()) == 0) {<a name="line.382"></a>
<span class="sourceLineNo">383</span>        node = node.succ;<a name="line.383"></a>
<span class="sourceLineNo">384</span>      }<a name="line.384"></a>
<span class="sourceLineNo">385</span>    } else {<a name="line.385"></a>
<span class="sourceLineNo">386</span>      node = header.succ;<a name="line.386"></a>
<span class="sourceLineNo">387</span>    }<a name="line.387"></a>
<span class="sourceLineNo">388</span>    return (node == header || !range.contains(node.getElement())) ? null : node;<a name="line.388"></a>
<span class="sourceLineNo">389</span>  }<a name="line.389"></a>
<span class="sourceLineNo">390</span><a name="line.390"></a>
<span class="sourceLineNo">391</span>  @Nullable private AvlNode&lt;E&gt; lastNode() {<a name="line.391"></a>
<span class="sourceLineNo">392</span>    AvlNode&lt;E&gt; root = rootReference.get();<a name="line.392"></a>
<span class="sourceLineNo">393</span>    if (root == null) {<a name="line.393"></a>
<span class="sourceLineNo">394</span>      return null;<a name="line.394"></a>
<span class="sourceLineNo">395</span>    }<a name="line.395"></a>
<span class="sourceLineNo">396</span>    AvlNode&lt;E&gt; node;<a name="line.396"></a>
<span class="sourceLineNo">397</span>    if (range.hasUpperBound()) {<a name="line.397"></a>
<span class="sourceLineNo">398</span>      E endpoint = range.getUpperEndpoint();<a name="line.398"></a>
<span class="sourceLineNo">399</span>      node = rootReference.get().floor(comparator(), endpoint);<a name="line.399"></a>
<span class="sourceLineNo">400</span>      if (node == null) {<a name="line.400"></a>
<span class="sourceLineNo">401</span>        return null;<a name="line.401"></a>
<span class="sourceLineNo">402</span>      }<a name="line.402"></a>
<span class="sourceLineNo">403</span>      if (range.getUpperBoundType() == BoundType.OPEN<a name="line.403"></a>
<span class="sourceLineNo">404</span>          &amp;&amp; comparator().compare(endpoint, node.getElement()) == 0) {<a name="line.404"></a>
<span class="sourceLineNo">405</span>        node = node.pred;<a name="line.405"></a>
<span class="sourceLineNo">406</span>      }<a name="line.406"></a>
<span class="sourceLineNo">407</span>    } else {<a name="line.407"></a>
<span class="sourceLineNo">408</span>      node = header.pred;<a name="line.408"></a>
<span class="sourceLineNo">409</span>    }<a name="line.409"></a>
<span class="sourceLineNo">410</span>    return (node == header || !range.contains(node.getElement())) ? null : node;<a name="line.410"></a>
<span class="sourceLineNo">411</span>  }<a name="line.411"></a>
<span class="sourceLineNo">412</span><a name="line.412"></a>
<span class="sourceLineNo">413</span>  @Override<a name="line.413"></a>
<span class="sourceLineNo">414</span>  Iterator&lt;Entry&lt;E&gt;&gt; entryIterator() {<a name="line.414"></a>
<span class="sourceLineNo">415</span>    return new Iterator&lt;Entry&lt;E&gt;&gt;() {<a name="line.415"></a>
<span class="sourceLineNo">416</span>      AvlNode&lt;E&gt; current = firstNode();<a name="line.416"></a>
<span class="sourceLineNo">417</span>      Entry&lt;E&gt; prevEntry;<a name="line.417"></a>
<span class="sourceLineNo">418</span><a name="line.418"></a>
<span class="sourceLineNo">419</span>      @Override<a name="line.419"></a>
<span class="sourceLineNo">420</span>      public boolean hasNext() {<a name="line.420"></a>
<span class="sourceLineNo">421</span>        if (current == null) {<a name="line.421"></a>
<span class="sourceLineNo">422</span>          return false;<a name="line.422"></a>
<span class="sourceLineNo">423</span>        } else if (range.tooHigh(current.getElement())) {<a name="line.423"></a>
<span class="sourceLineNo">424</span>          current = null;<a name="line.424"></a>
<span class="sourceLineNo">425</span>          return false;<a name="line.425"></a>
<span class="sourceLineNo">426</span>        } else {<a name="line.426"></a>
<span class="sourceLineNo">427</span>          return true;<a name="line.427"></a>
<span class="sourceLineNo">428</span>        }<a name="line.428"></a>
<span class="sourceLineNo">429</span>      }<a name="line.429"></a>
<span class="sourceLineNo">430</span><a name="line.430"></a>
<span class="sourceLineNo">431</span>      @Override<a name="line.431"></a>
<span class="sourceLineNo">432</span>      public Entry&lt;E&gt; next() {<a name="line.432"></a>
<span class="sourceLineNo">433</span>        if (!hasNext()) {<a name="line.433"></a>
<span class="sourceLineNo">434</span>          throw new NoSuchElementException();<a name="line.434"></a>
<span class="sourceLineNo">435</span>        }<a name="line.435"></a>
<span class="sourceLineNo">436</span>        Entry&lt;E&gt; result = wrapEntry(current);<a name="line.436"></a>
<span class="sourceLineNo">437</span>        prevEntry = result;<a name="line.437"></a>
<span class="sourceLineNo">438</span>        if (current.succ == header) {<a name="line.438"></a>
<span class="sourceLineNo">439</span>          current = null;<a name="line.439"></a>
<span class="sourceLineNo">440</span>        } else {<a name="line.440"></a>
<span class="sourceLineNo">441</span>          current = current.succ;<a name="line.441"></a>
<span class="sourceLineNo">442</span>        }<a name="line.442"></a>
<span class="sourceLineNo">443</span>        return result;<a name="line.443"></a>
<span class="sourceLineNo">444</span>      }<a name="line.444"></a>
<span class="sourceLineNo">445</span><a name="line.445"></a>
<span class="sourceLineNo">446</span>      @Override<a name="line.446"></a>
<span class="sourceLineNo">447</span>      public void remove() {<a name="line.447"></a>
<span class="sourceLineNo">448</span>        checkState(prevEntry != null);<a name="line.448"></a>
<span class="sourceLineNo">449</span>        setCount(prevEntry.getElement(), 0);<a name="line.449"></a>
<span class="sourceLineNo">450</span>        prevEntry = null;<a name="line.450"></a>
<span class="sourceLineNo">451</span>      }<a name="line.451"></a>
<span class="sourceLineNo">452</span>    };<a name="line.452"></a>
<span class="sourceLineNo">453</span>  }<a name="line.453"></a>
<span class="sourceLineNo">454</span><a name="line.454"></a>
<span class="sourceLineNo">455</span>  @Override<a name="line.455"></a>
<span class="sourceLineNo">456</span>  Iterator&lt;Entry&lt;E&gt;&gt; descendingEntryIterator() {<a name="line.456"></a>
<span class="sourceLineNo">457</span>    return new Iterator&lt;Entry&lt;E&gt;&gt;() {<a name="line.457"></a>
<span class="sourceLineNo">458</span>      AvlNode&lt;E&gt; current = lastNode();<a name="line.458"></a>
<span class="sourceLineNo">459</span>      Entry&lt;E&gt; prevEntry = null;<a name="line.459"></a>
<span class="sourceLineNo">460</span><a name="line.460"></a>
<span class="sourceLineNo">461</span>      @Override<a name="line.461"></a>
<span class="sourceLineNo">462</span>      public boolean hasNext() {<a name="line.462"></a>
<span class="sourceLineNo">463</span>        if (current == null) {<a name="line.463"></a>
<span class="sourceLineNo">464</span>          return false;<a name="line.464"></a>
<span class="sourceLineNo">465</span>        } else if (range.tooLow(current.getElement())) {<a name="line.465"></a>
<span class="sourceLineNo">466</span>          current = null;<a name="line.466"></a>
<span class="sourceLineNo">467</span>          return false;<a name="line.467"></a>
<span class="sourceLineNo">468</span>        } else {<a name="line.468"></a>
<span class="sourceLineNo">469</span>          return true;<a name="line.469"></a>
<span class="sourceLineNo">470</span>        }<a name="line.470"></a>
<span class="sourceLineNo">471</span>      }<a name="line.471"></a>
<span class="sourceLineNo">472</span><a name="line.472"></a>
<span class="sourceLineNo">473</span>      @Override<a name="line.473"></a>
<span class="sourceLineNo">474</span>      public Entry&lt;E&gt; next() {<a name="line.474"></a>
<span class="sourceLineNo">475</span>        if (!hasNext()) {<a name="line.475"></a>
<span class="sourceLineNo">476</span>          throw new NoSuchElementException();<a name="line.476"></a>
<span class="sourceLineNo">477</span>        }<a name="line.477"></a>
<span class="sourceLineNo">478</span>        Entry&lt;E&gt; result = wrapEntry(current);<a name="line.478"></a>
<span class="sourceLineNo">479</span>        prevEntry = result;<a name="line.479"></a>
<span class="sourceLineNo">480</span>        if (current.pred == header) {<a name="line.480"></a>
<span class="sourceLineNo">481</span>          current = null;<a name="line.481"></a>
<span class="sourceLineNo">482</span>        } else {<a name="line.482"></a>
<span class="sourceLineNo">483</span>          current = current.pred;<a name="line.483"></a>
<span class="sourceLineNo">484</span>        }<a name="line.484"></a>
<span class="sourceLineNo">485</span>        return result;<a name="line.485"></a>
<span class="sourceLineNo">486</span>      }<a name="line.486"></a>
<span class="sourceLineNo">487</span><a name="line.487"></a>
<span class="sourceLineNo">488</span>      @Override<a name="line.488"></a>
<span class="sourceLineNo">489</span>      public void remove() {<a name="line.489"></a>
<span class="sourceLineNo">490</span>        checkState(prevEntry != null);<a name="line.490"></a>
<span class="sourceLineNo">491</span>        setCount(prevEntry.getElement(), 0);<a name="line.491"></a>
<span class="sourceLineNo">492</span>        prevEntry = null;<a name="line.492"></a>
<span class="sourceLineNo">493</span>      }<a name="line.493"></a>
<span class="sourceLineNo">494</span>    };<a name="line.494"></a>
<span class="sourceLineNo">495</span>  }<a name="line.495"></a>
<span class="sourceLineNo">496</span><a name="line.496"></a>
<span class="sourceLineNo">497</span>  @Override<a name="line.497"></a>
<span class="sourceLineNo">498</span>  public SortedMultiset&lt;E&gt; headMultiset(@Nullable E upperBound, BoundType boundType) {<a name="line.498"></a>
<span class="sourceLineNo">499</span>    return new TreeMultiset&lt;E&gt;(rootReference, range.intersect(GeneralRange.upTo(<a name="line.499"></a>
<span class="sourceLineNo">500</span>        comparator(),<a name="line.500"></a>
<span class="sourceLineNo">501</span>        upperBound,<a name="line.501"></a>
<span class="sourceLineNo">502</span>        boundType)), header);<a name="line.502"></a>
<span class="sourceLineNo">503</span>  }<a name="line.503"></a>
<span class="sourceLineNo">504</span><a name="line.504"></a>
<span class="sourceLineNo">505</span>  @Override<a name="line.505"></a>
<span class="sourceLineNo">506</span>  public SortedMultiset&lt;E&gt; tailMultiset(@Nullable E lowerBound, BoundType boundType) {<a name="line.506"></a>
<span class="sourceLineNo">507</span>    return new TreeMultiset&lt;E&gt;(rootReference, range.intersect(GeneralRange.downTo(<a name="line.507"></a>
<span class="sourceLineNo">508</span>        comparator(),<a name="line.508"></a>
<span class="sourceLineNo">509</span>        lowerBound,<a name="line.509"></a>
<span class="sourceLineNo">510</span>        boundType)), header);<a name="line.510"></a>
<span class="sourceLineNo">511</span>  }<a name="line.511"></a>
<span class="sourceLineNo">512</span><a name="line.512"></a>
<span class="sourceLineNo">513</span>  static int distinctElements(@Nullable AvlNode&lt;?&gt; node) {<a name="line.513"></a>
<span class="sourceLineNo">514</span>    return (node == null) ? 0 : node.distinctElements;<a name="line.514"></a>
<span class="sourceLineNo">515</span>  }<a name="line.515"></a>
<span class="sourceLineNo">516</span><a name="line.516"></a>
<span class="sourceLineNo">517</span>  private static final class Reference&lt;T&gt; {<a name="line.517"></a>
<span class="sourceLineNo">518</span>    @Nullable private T value;<a name="line.518"></a>
<span class="sourceLineNo">519</span><a name="line.519"></a>
<span class="sourceLineNo">520</span>    @Nullable public T get() {<a name="line.520"></a>
<span class="sourceLineNo">521</span>      return value;<a name="line.521"></a>
<span class="sourceLineNo">522</span>    }<a name="line.522"></a>
<span class="sourceLineNo">523</span><a name="line.523"></a>
<span class="sourceLineNo">524</span>    public void checkAndSet(@Nullable T expected, T newValue) {<a name="line.524"></a>
<span class="sourceLineNo">525</span>      if (value != expected) {<a name="line.525"></a>
<span class="sourceLineNo">526</span>        throw new ConcurrentModificationException();<a name="line.526"></a>
<span class="sourceLineNo">527</span>      }<a name="line.527"></a>
<span class="sourceLineNo">528</span>      value = newValue;<a name="line.528"></a>
<span class="sourceLineNo">529</span>    }<a name="line.529"></a>
<span class="sourceLineNo">530</span>  }<a name="line.530"></a>
<span class="sourceLineNo">531</span><a name="line.531"></a>
<span class="sourceLineNo">532</span>  private static final class AvlNode&lt;E&gt; extends Multisets.AbstractEntry&lt;E&gt; {<a name="line.532"></a>
<span class="sourceLineNo">533</span>    @Nullable private final E elem;<a name="line.533"></a>
<span class="sourceLineNo">534</span><a name="line.534"></a>
<span class="sourceLineNo">535</span>    // elemCount is 0 iff this node has been deleted.<a name="line.535"></a>
<span class="sourceLineNo">536</span>    private int elemCount;<a name="line.536"></a>
<span class="sourceLineNo">537</span><a name="line.537"></a>
<span class="sourceLineNo">538</span>    private int distinctElements;<a name="line.538"></a>
<span class="sourceLineNo">539</span>    private long totalCount;<a name="line.539"></a>
<span class="sourceLineNo">540</span>    private int height;<a name="line.540"></a>
<span class="sourceLineNo">541</span>    private AvlNode&lt;E&gt; left;<a name="line.541"></a>
<span class="sourceLineNo">542</span>    private AvlNode&lt;E&gt; right;<a name="line.542"></a>
<span class="sourceLineNo">543</span>    private AvlNode&lt;E&gt; pred;<a name="line.543"></a>
<span class="sourceLineNo">544</span>    private AvlNode&lt;E&gt; succ;<a name="line.544"></a>
<span class="sourceLineNo">545</span><a name="line.545"></a>
<span class="sourceLineNo">546</span>    AvlNode(@Nullable E elem, int elemCount) {<a name="line.546"></a>
<span class="sourceLineNo">547</span>      checkArgument(elemCount &gt; 0);<a name="line.547"></a>
<span class="sourceLineNo">548</span>      this.elem = elem;<a name="line.548"></a>
<span class="sourceLineNo">549</span>      this.elemCount = elemCount;<a name="line.549"></a>
<span class="sourceLineNo">550</span>      this.totalCount = elemCount;<a name="line.550"></a>
<span class="sourceLineNo">551</span>      this.distinctElements = 1;<a name="line.551"></a>
<span class="sourceLineNo">552</span>      this.height = 1;<a name="line.552"></a>
<span class="sourceLineNo">553</span>      this.left = null;<a name="line.553"></a>
<span class="sourceLineNo">554</span>      this.right = null;<a name="line.554"></a>
<span class="sourceLineNo">555</span>    }<a name="line.555"></a>
<span class="sourceLineNo">556</span><a name="line.556"></a>
<span class="sourceLineNo">557</span>    public int count(Comparator&lt;? super E&gt; comparator, E e) {<a name="line.557"></a>
<span class="sourceLineNo">558</span>      int cmp = comparator.compare(e, elem);<a name="line.558"></a>
<span class="sourceLineNo">559</span>      if (cmp &lt; 0) {<a name="line.559"></a>
<span class="sourceLineNo">560</span>        return (left == null) ? 0 : left.count(comparator, e);<a name="line.560"></a>
<span class="sourceLineNo">561</span>      } else if (cmp &gt; 0) {<a name="line.561"></a>
<span class="sourceLineNo">562</span>        return (right == null) ? 0 : right.count(comparator, e);<a name="line.562"></a>
<span class="sourceLineNo">563</span>      } else {<a name="line.563"></a>
<span class="sourceLineNo">564</span>        return elemCount;<a name="line.564"></a>
<span class="sourceLineNo">565</span>      }<a name="line.565"></a>
<span class="sourceLineNo">566</span>    }<a name="line.566"></a>
<span class="sourceLineNo">567</span><a name="line.567"></a>
<span class="sourceLineNo">568</span>    private AvlNode&lt;E&gt; addRightChild(E e, int count) {<a name="line.568"></a>
<span class="sourceLineNo">569</span>      right = new AvlNode&lt;E&gt;(e, count);<a name="line.569"></a>
<span class="sourceLineNo">570</span>      successor(this, right, succ);<a name="line.570"></a>
<span class="sourceLineNo">571</span>      height = Math.max(2, height);<a name="line.571"></a>
<span class="sourceLineNo">572</span>      distinctElements++;<a name="line.572"></a>
<span class="sourceLineNo">573</span>      totalCount += count;<a name="line.573"></a>
<span class="sourceLineNo">574</span>      return this;<a name="line.574"></a>
<span class="sourceLineNo">575</span>    }<a name="line.575"></a>
<span class="sourceLineNo">576</span><a name="line.576"></a>
<span class="sourceLineNo">577</span>    private AvlNode&lt;E&gt; addLeftChild(E e, int count) {<a name="line.577"></a>
<span class="sourceLineNo">578</span>      left = new AvlNode&lt;E&gt;(e, count);<a name="line.578"></a>
<span class="sourceLineNo">579</span>      successor(pred, left, this);<a name="line.579"></a>
<span class="sourceLineNo">580</span>      height = Math.max(2, height);<a name="line.580"></a>
<span class="sourceLineNo">581</span>      distinctElements++;<a name="line.581"></a>
<span class="sourceLineNo">582</span>      totalCount += count;<a name="line.582"></a>
<span class="sourceLineNo">583</span>      return this;<a name="line.583"></a>
<span class="sourceLineNo">584</span>    }<a name="line.584"></a>
<span class="sourceLineNo">585</span><a name="line.585"></a>
<span class="sourceLineNo">586</span>    AvlNode&lt;E&gt; add(Comparator&lt;? super E&gt; comparator, @Nullable E e, int count, int[] result) {<a name="line.586"></a>
<span class="sourceLineNo">587</span>      /*<a name="line.587"></a>
<span class="sourceLineNo">588</span>       * It speeds things up considerably to unconditionally add count to totalCount here,<a name="line.588"></a>
<span class="sourceLineNo">589</span>       * but that destroys failure atomicity in the case of count overflow. =(<a name="line.589"></a>
<span class="sourceLineNo">590</span>       */<a name="line.590"></a>
<span class="sourceLineNo">591</span>      int cmp = comparator.compare(e, elem);<a name="line.591"></a>
<span class="sourceLineNo">592</span>      if (cmp &lt; 0) {<a name="line.592"></a>
<span class="sourceLineNo">593</span>        AvlNode&lt;E&gt; initLeft = left;<a name="line.593"></a>
<span class="sourceLineNo">594</span>        if (initLeft == null) {<a name="line.594"></a>
<span class="sourceLineNo">595</span>          result[0] = 0;<a name="line.595"></a>
<span class="sourceLineNo">596</span>          return addLeftChild(e, count);<a name="line.596"></a>
<span class="sourceLineNo">597</span>        }<a name="line.597"></a>
<span class="sourceLineNo">598</span>        int initHeight = initLeft.height;<a name="line.598"></a>
<span class="sourceLineNo">599</span><a name="line.599"></a>
<span class="sourceLineNo">600</span>        left = initLeft.add(comparator, e, count, result);<a name="line.600"></a>
<span class="sourceLineNo">601</span>        if (result[0] == 0) {<a name="line.601"></a>
<span class="sourceLineNo">602</span>          distinctElements++;<a name="line.602"></a>
<span class="sourceLineNo">603</span>        }<a name="line.603"></a>
<span class="sourceLineNo">604</span>        this.totalCount += count;<a name="line.604"></a>
<span class="sourceLineNo">605</span>        return (left.height == initHeight) ? this : rebalance();<a name="line.605"></a>
<span class="sourceLineNo">606</span>      } else if (cmp &gt; 0) {<a name="line.606"></a>
<span class="sourceLineNo">607</span>        AvlNode&lt;E&gt; initRight = right;<a name="line.607"></a>
<span class="sourceLineNo">608</span>        if (initRight == null) {<a name="line.608"></a>
<span class="sourceLineNo">609</span>          result[0] = 0;<a name="line.609"></a>
<span class="sourceLineNo">610</span>          return addRightChild(e, count);<a name="line.610"></a>
<span class="sourceLineNo">611</span>        }<a name="line.611"></a>
<span class="sourceLineNo">612</span>        int initHeight = initRight.height;<a name="line.612"></a>
<span class="sourceLineNo">613</span><a name="line.613"></a>
<span class="sourceLineNo">614</span>        right = initRight.add(comparator, e, count, result);<a name="line.614"></a>
<span class="sourceLineNo">615</span>        if (result[0] == 0) {<a name="line.615"></a>
<span class="sourceLineNo">616</span>          distinctElements++;<a name="line.616"></a>
<span class="sourceLineNo">617</span>        }<a name="line.617"></a>
<span class="sourceLineNo">618</span>        this.totalCount += count;<a name="line.618"></a>
<span class="sourceLineNo">619</span>        return (right.height == initHeight) ? this : rebalance();<a name="line.619"></a>
<span class="sourceLineNo">620</span>      }<a name="line.620"></a>
<span class="sourceLineNo">621</span><a name="line.621"></a>
<span class="sourceLineNo">622</span>      // adding count to me!  No rebalance possible.<a name="line.622"></a>
<span class="sourceLineNo">623</span>      result[0] = elemCount;<a name="line.623"></a>
<span class="sourceLineNo">624</span>      long resultCount = (long) elemCount + count;<a name="line.624"></a>
<span class="sourceLineNo">625</span>      checkArgument(resultCount &lt;= Integer.MAX_VALUE);<a name="line.625"></a>
<span class="sourceLineNo">626</span>      this.elemCount += count;<a name="line.626"></a>
<span class="sourceLineNo">627</span>      this.totalCount += count;<a name="line.627"></a>
<span class="sourceLineNo">628</span>      return this;<a name="line.628"></a>
<span class="sourceLineNo">629</span>    }<a name="line.629"></a>
<span class="sourceLineNo">630</span><a name="line.630"></a>
<span class="sourceLineNo">631</span>    AvlNode&lt;E&gt; remove(Comparator&lt;? super E&gt; comparator, @Nullable E e, int count, int[] result) {<a name="line.631"></a>
<span class="sourceLineNo">632</span>      int cmp = comparator.compare(e, elem);<a name="line.632"></a>
<span class="sourceLineNo">633</span>      if (cmp &lt; 0) {<a name="line.633"></a>
<span class="sourceLineNo">634</span>        AvlNode&lt;E&gt; initLeft = left;<a name="line.634"></a>
<span class="sourceLineNo">635</span>        if (initLeft == null) {<a name="line.635"></a>
<span class="sourceLineNo">636</span>          result[0] = 0;<a name="line.636"></a>
<span class="sourceLineNo">637</span>          return this;<a name="line.637"></a>
<span class="sourceLineNo">638</span>        }<a name="line.638"></a>
<span class="sourceLineNo">639</span><a name="line.639"></a>
<span class="sourceLineNo">640</span>        left = initLeft.remove(comparator, e, count, result);<a name="line.640"></a>
<span class="sourceLineNo">641</span><a name="line.641"></a>
<span class="sourceLineNo">642</span>        if (result[0] &gt; 0) {<a name="line.642"></a>
<span class="sourceLineNo">643</span>          if (count &gt;= result[0]) {<a name="line.643"></a>
<span class="sourceLineNo">644</span>            this.distinctElements--;<a name="line.644"></a>
<span class="sourceLineNo">645</span>            this.totalCount -= result[0];<a name="line.645"></a>
<span class="sourceLineNo">646</span>          } else {<a name="line.646"></a>
<span class="sourceLineNo">647</span>            this.totalCount -= count;<a name="line.647"></a>
<span class="sourceLineNo">648</span>          }<a name="line.648"></a>
<span class="sourceLineNo">649</span>        }<a name="line.649"></a>
<span class="sourceLineNo">650</span>        return (result[0] == 0) ? this : rebalance();<a name="line.650"></a>
<span class="sourceLineNo">651</span>      } else if (cmp &gt; 0) {<a name="line.651"></a>
<span class="sourceLineNo">652</span>        AvlNode&lt;E&gt; initRight = right;<a name="line.652"></a>
<span class="sourceLineNo">653</span>        if (initRight == null) {<a name="line.653"></a>
<span class="sourceLineNo">654</span>          result[0] = 0;<a name="line.654"></a>
<span class="sourceLineNo">655</span>          return this;<a name="line.655"></a>
<span class="sourceLineNo">656</span>        }<a name="line.656"></a>
<span class="sourceLineNo">657</span><a name="line.657"></a>
<span class="sourceLineNo">658</span>        right = initRight.remove(comparator, e, count, result);<a name="line.658"></a>
<span class="sourceLineNo">659</span><a name="line.659"></a>
<span class="sourceLineNo">660</span>        if (result[0] &gt; 0) {<a name="line.660"></a>
<span class="sourceLineNo">661</span>          if (count &gt;= result[0]) {<a name="line.661"></a>
<span class="sourceLineNo">662</span>            this.distinctElements--;<a name="line.662"></a>
<span class="sourceLineNo">663</span>            this.totalCount -= result[0];<a name="line.663"></a>
<span class="sourceLineNo">664</span>          } else {<a name="line.664"></a>
<span class="sourceLineNo">665</span>            this.totalCount -= count;<a name="line.665"></a>
<span class="sourceLineNo">666</span>          }<a name="line.666"></a>
<span class="sourceLineNo">667</span>        }<a name="line.667"></a>
<span class="sourceLineNo">668</span>        return rebalance();<a name="line.668"></a>
<span class="sourceLineNo">669</span>      }<a name="line.669"></a>
<span class="sourceLineNo">670</span><a name="line.670"></a>
<span class="sourceLineNo">671</span>      // removing count from me!<a name="line.671"></a>
<span class="sourceLineNo">672</span>      result[0] = elemCount;<a name="line.672"></a>
<span class="sourceLineNo">673</span>      if (count &gt;= elemCount) {<a name="line.673"></a>
<span class="sourceLineNo">674</span>        return deleteMe();<a name="line.674"></a>
<span class="sourceLineNo">675</span>      } else {<a name="line.675"></a>
<span class="sourceLineNo">676</span>        this.elemCount -= count;<a name="line.676"></a>
<span class="sourceLineNo">677</span>        this.totalCount -= count;<a name="line.677"></a>
<span class="sourceLineNo">678</span>        return this;<a name="line.678"></a>
<span class="sourceLineNo">679</span>      }<a name="line.679"></a>
<span class="sourceLineNo">680</span>    }<a name="line.680"></a>
<span class="sourceLineNo">681</span><a name="line.681"></a>
<span class="sourceLineNo">682</span>    AvlNode&lt;E&gt; setCount(Comparator&lt;? super E&gt; comparator, @Nullable E e, int count, int[] result) {<a name="line.682"></a>
<span class="sourceLineNo">683</span>      int cmp = comparator.compare(e, elem);<a name="line.683"></a>
<span class="sourceLineNo">684</span>      if (cmp &lt; 0) {<a name="line.684"></a>
<span class="sourceLineNo">685</span>        AvlNode&lt;E&gt; initLeft = left;<a name="line.685"></a>
<span class="sourceLineNo">686</span>        if (initLeft == null) {<a name="line.686"></a>
<span class="sourceLineNo">687</span>          result[0] = 0;<a name="line.687"></a>
<span class="sourceLineNo">688</span>          return (count &gt; 0) ? addLeftChild(e, count) : this;<a name="line.688"></a>
<span class="sourceLineNo">689</span>        }<a name="line.689"></a>
<span class="sourceLineNo">690</span><a name="line.690"></a>
<span class="sourceLineNo">691</span>        left = initLeft.setCount(comparator, e, count, result);<a name="line.691"></a>
<span class="sourceLineNo">692</span><a name="line.692"></a>
<span class="sourceLineNo">693</span>        if (count == 0 &amp;&amp; result[0] != 0) {<a name="line.693"></a>
<span class="sourceLineNo">694</span>          this.distinctElements--;<a name="line.694"></a>
<span class="sourceLineNo">695</span>        } else if (count &gt; 0 &amp;&amp; result[0] == 0) {<a name="line.695"></a>
<span class="sourceLineNo">696</span>          this.distinctElements++;<a name="line.696"></a>
<span class="sourceLineNo">697</span>        }<a name="line.697"></a>
<span class="sourceLineNo">698</span><a name="line.698"></a>
<span class="sourceLineNo">699</span>        this.totalCount += count - result[0];<a name="line.699"></a>
<span class="sourceLineNo">700</span>        return rebalance();<a name="line.700"></a>
<span class="sourceLineNo">701</span>      } else if (cmp &gt; 0) {<a name="line.701"></a>
<span class="sourceLineNo">702</span>        AvlNode&lt;E&gt; initRight = right;<a name="line.702"></a>
<span class="sourceLineNo">703</span>        if (initRight == null) {<a name="line.703"></a>
<span class="sourceLineNo">704</span>          result[0] = 0;<a name="line.704"></a>
<span class="sourceLineNo">705</span>          return (count &gt; 0) ? addRightChild(e, count) : this;<a name="line.705"></a>
<span class="sourceLineNo">706</span>        }<a name="line.706"></a>
<span class="sourceLineNo">707</span><a name="line.707"></a>
<span class="sourceLineNo">708</span>        right = initRight.setCount(comparator, e, count, result);<a name="line.708"></a>
<span class="sourceLineNo">709</span><a name="line.709"></a>
<span class="sourceLineNo">710</span>        if (count == 0 &amp;&amp; result[0] != 0) {<a name="line.710"></a>
<span class="sourceLineNo">711</span>          this.distinctElements--;<a name="line.711"></a>
<span class="sourceLineNo">712</span>        } else if (count &gt; 0 &amp;&amp; result[0] == 0) {<a name="line.712"></a>
<span class="sourceLineNo">713</span>          this.distinctElements++;<a name="line.713"></a>
<span class="sourceLineNo">714</span>        }<a name="line.714"></a>
<span class="sourceLineNo">715</span><a name="line.715"></a>
<span class="sourceLineNo">716</span>        this.totalCount += count - result[0];<a name="line.716"></a>
<span class="sourceLineNo">717</span>        return rebalance();<a name="line.717"></a>
<span class="sourceLineNo">718</span>      }<a name="line.718"></a>
<span class="sourceLineNo">719</span><a name="line.719"></a>
<span class="sourceLineNo">720</span>      // setting my count<a name="line.720"></a>
<span class="sourceLineNo">721</span>      result[0] = elemCount;<a name="line.721"></a>
<span class="sourceLineNo">722</span>      if (count == 0) {<a name="line.722"></a>
<span class="sourceLineNo">723</span>        return deleteMe();<a name="line.723"></a>
<span class="sourceLineNo">724</span>      }<a name="line.724"></a>
<span class="sourceLineNo">725</span>      this.totalCount += count - elemCount;<a name="line.725"></a>
<span class="sourceLineNo">726</span>      this.elemCount = count;<a name="line.726"></a>
<span class="sourceLineNo">727</span>      return this;<a name="line.727"></a>
<span class="sourceLineNo">728</span>    }<a name="line.728"></a>
<span class="sourceLineNo">729</span><a name="line.729"></a>
<span class="sourceLineNo">730</span>    AvlNode&lt;E&gt; setCount(<a name="line.730"></a>
<span class="sourceLineNo">731</span>        Comparator&lt;? super E&gt; comparator,<a name="line.731"></a>
<span class="sourceLineNo">732</span>        @Nullable E e,<a name="line.732"></a>
<span class="sourceLineNo">733</span>        int expectedCount,<a name="line.733"></a>
<span class="sourceLineNo">734</span>        int newCount,<a name="line.734"></a>
<span class="sourceLineNo">735</span>        int[] result) {<a name="line.735"></a>
<span class="sourceLineNo">736</span>      int cmp = comparator.compare(e, elem);<a name="line.736"></a>
<span class="sourceLineNo">737</span>      if (cmp &lt; 0) {<a name="line.737"></a>
<span class="sourceLineNo">738</span>        AvlNode&lt;E&gt; initLeft = left;<a name="line.738"></a>
<span class="sourceLineNo">739</span>        if (initLeft == null) {<a name="line.739"></a>
<span class="sourceLineNo">740</span>          result[0] = 0;<a name="line.740"></a>
<span class="sourceLineNo">741</span>          if (expectedCount == 0 &amp;&amp; newCount &gt; 0) {<a name="line.741"></a>
<span class="sourceLineNo">742</span>            return addLeftChild(e, newCount);<a name="line.742"></a>
<span class="sourceLineNo">743</span>          }<a name="line.743"></a>
<span class="sourceLineNo">744</span>          return this;<a name="line.744"></a>
<span class="sourceLineNo">745</span>        }<a name="line.745"></a>
<span class="sourceLineNo">746</span><a name="line.746"></a>
<span class="sourceLineNo">747</span>        left = initLeft.setCount(comparator, e, expectedCount, newCount, result);<a name="line.747"></a>
<span class="sourceLineNo">748</span><a name="line.748"></a>
<span class="sourceLineNo">749</span>        if (result[0] == expectedCount) {<a name="line.749"></a>
<span class="sourceLineNo">750</span>          if (newCount == 0 &amp;&amp; result[0] != 0) {<a name="line.750"></a>
<span class="sourceLineNo">751</span>            this.distinctElements--;<a name="line.751"></a>
<span class="sourceLineNo">752</span>          } else if (newCount &gt; 0 &amp;&amp; result[0] == 0) {<a name="line.752"></a>
<span class="sourceLineNo">753</span>            this.distinctElements++;<a name="line.753"></a>
<span class="sourceLineNo">754</span>          }<a name="line.754"></a>
<span class="sourceLineNo">755</span>          this.totalCount += newCount - result[0];<a name="line.755"></a>
<span class="sourceLineNo">756</span>        }<a name="line.756"></a>
<span class="sourceLineNo">757</span>        return rebalance();<a name="line.757"></a>
<span class="sourceLineNo">758</span>      } else if (cmp &gt; 0) {<a name="line.758"></a>
<span class="sourceLineNo">759</span>        AvlNode&lt;E&gt; initRight = right;<a name="line.759"></a>
<span class="sourceLineNo">760</span>        if (initRight == null) {<a name="line.760"></a>
<span class="sourceLineNo">761</span>          result[0] = 0;<a name="line.761"></a>
<span class="sourceLineNo">762</span>          if (expectedCount == 0 &amp;&amp; newCount &gt; 0) {<a name="line.762"></a>
<span class="sourceLineNo">763</span>            return addRightChild(e, newCount);<a name="line.763"></a>
<span class="sourceLineNo">764</span>          }<a name="line.764"></a>
<span class="sourceLineNo">765</span>          return this;<a name="line.765"></a>
<span class="sourceLineNo">766</span>        }<a name="line.766"></a>
<span class="sourceLineNo">767</span><a name="line.767"></a>
<span class="sourceLineNo">768</span>        right = initRight.setCount(comparator, e, expectedCount, newCount, result);<a name="line.768"></a>
<span class="sourceLineNo">769</span><a name="line.769"></a>
<span class="sourceLineNo">770</span>        if (result[0] == expectedCount) {<a name="line.770"></a>
<span class="sourceLineNo">771</span>          if (newCount == 0 &amp;&amp; result[0] != 0) {<a name="line.771"></a>
<span class="sourceLineNo">772</span>            this.distinctElements--;<a name="line.772"></a>
<span class="sourceLineNo">773</span>          } else if (newCount &gt; 0 &amp;&amp; result[0] == 0) {<a name="line.773"></a>
<span class="sourceLineNo">774</span>            this.distinctElements++;<a name="line.774"></a>
<span class="sourceLineNo">775</span>          }<a name="line.775"></a>
<span class="sourceLineNo">776</span>          this.totalCount += newCount - result[0];<a name="line.776"></a>
<span class="sourceLineNo">777</span>        }<a name="line.777"></a>
<span class="sourceLineNo">778</span>        return rebalance();<a name="line.778"></a>
<span class="sourceLineNo">779</span>      }<a name="line.779"></a>
<span class="sourceLineNo">780</span><a name="line.780"></a>
<span class="sourceLineNo">781</span>      // setting my count<a name="line.781"></a>
<span class="sourceLineNo">782</span>      result[0] = elemCount;<a name="line.782"></a>
<span class="sourceLineNo">783</span>      if (expectedCount == elemCount) {<a name="line.783"></a>
<span class="sourceLineNo">784</span>        if (newCount == 0) {<a name="line.784"></a>
<span class="sourceLineNo">785</span>          return deleteMe();<a name="line.785"></a>
<span class="sourceLineNo">786</span>        }<a name="line.786"></a>
<span class="sourceLineNo">787</span>        this.totalCount += newCount - elemCount;<a name="line.787"></a>
<span class="sourceLineNo">788</span>        this.elemCount = newCount;<a name="line.788"></a>
<span class="sourceLineNo">789</span>      }<a name="line.789"></a>
<span class="sourceLineNo">790</span>      return this;<a name="line.790"></a>
<span class="sourceLineNo">791</span>    }<a name="line.791"></a>
<span class="sourceLineNo">792</span><a name="line.792"></a>
<span class="sourceLineNo">793</span>    private AvlNode&lt;E&gt; deleteMe() {<a name="line.793"></a>
<span class="sourceLineNo">794</span>      int oldElemCount = this.elemCount;<a name="line.794"></a>
<span class="sourceLineNo">795</span>      this.elemCount = 0;<a name="line.795"></a>
<span class="sourceLineNo">796</span>      successor(pred, succ);<a name="line.796"></a>
<span class="sourceLineNo">797</span>      if (left == null) {<a name="line.797"></a>
<span class="sourceLineNo">798</span>        return right;<a name="line.798"></a>
<span class="sourceLineNo">799</span>      } else if (right == null) {<a name="line.799"></a>
<span class="sourceLineNo">800</span>        return left;<a name="line.800"></a>
<span class="sourceLineNo">801</span>      } else if (left.height &gt;= right.height) {<a name="line.801"></a>
<span class="sourceLineNo">802</span>        AvlNode&lt;E&gt; newTop = pred;<a name="line.802"></a>
<span class="sourceLineNo">803</span>        // newTop is the maximum node in my left subtree<a name="line.803"></a>
<span class="sourceLineNo">804</span>        newTop.left = left.removeMax(newTop);<a name="line.804"></a>
<span class="sourceLineNo">805</span>        newTop.right = right;<a name="line.805"></a>
<span class="sourceLineNo">806</span>        newTop.distinctElements = distinctElements - 1;<a name="line.806"></a>
<span class="sourceLineNo">807</span>        newTop.totalCount = totalCount - oldElemCount;<a name="line.807"></a>
<span class="sourceLineNo">808</span>        return newTop.rebalance();<a name="line.808"></a>
<span class="sourceLineNo">809</span>      } else {<a name="line.809"></a>
<span class="sourceLineNo">810</span>        AvlNode&lt;E&gt; newTop = succ;<a name="line.810"></a>
<span class="sourceLineNo">811</span>        newTop.right = right.removeMin(newTop);<a name="line.811"></a>
<span class="sourceLineNo">812</span>        newTop.left = left;<a name="line.812"></a>
<span class="sourceLineNo">813</span>        newTop.distinctElements = distinctElements - 1;<a name="line.813"></a>
<span class="sourceLineNo">814</span>        newTop.totalCount = totalCount - oldElemCount;<a name="line.814"></a>
<span class="sourceLineNo">815</span>        return newTop.rebalance();<a name="line.815"></a>
<span class="sourceLineNo">816</span>      }<a name="line.816"></a>
<span class="sourceLineNo">817</span>    }<a name="line.817"></a>
<span class="sourceLineNo">818</span><a name="line.818"></a>
<span class="sourceLineNo">819</span>    // Removes the minimum node from this subtree to be reused elsewhere<a name="line.819"></a>
<span class="sourceLineNo">820</span>    private AvlNode&lt;E&gt; removeMin(AvlNode&lt;E&gt; node) {<a name="line.820"></a>
<span class="sourceLineNo">821</span>      if (left == null) {<a name="line.821"></a>
<span class="sourceLineNo">822</span>        return right;<a name="line.822"></a>
<span class="sourceLineNo">823</span>      } else {<a name="line.823"></a>
<span class="sourceLineNo">824</span>        left = left.removeMin(node);<a name="line.824"></a>
<span class="sourceLineNo">825</span>        distinctElements--;<a name="line.825"></a>
<span class="sourceLineNo">826</span>        totalCount -= node.elemCount;<a name="line.826"></a>
<span class="sourceLineNo">827</span>        return rebalance();<a name="line.827"></a>
<span class="sourceLineNo">828</span>      }<a name="line.828"></a>
<span class="sourceLineNo">829</span>    }<a name="line.829"></a>
<span class="sourceLineNo">830</span><a name="line.830"></a>
<span class="sourceLineNo">831</span>    // Removes the maximum node from this subtree to be reused elsewhere<a name="line.831"></a>
<span class="sourceLineNo">832</span>    private AvlNode&lt;E&gt; removeMax(AvlNode&lt;E&gt; node) {<a name="line.832"></a>
<span class="sourceLineNo">833</span>      if (right == null) {<a name="line.833"></a>
<span class="sourceLineNo">834</span>        return left;<a name="line.834"></a>
<span class="sourceLineNo">835</span>      } else {<a name="line.835"></a>
<span class="sourceLineNo">836</span>        right = right.removeMax(node);<a name="line.836"></a>
<span class="sourceLineNo">837</span>        distinctElements--;<a name="line.837"></a>
<span class="sourceLineNo">838</span>        totalCount -= node.elemCount;<a name="line.838"></a>
<span class="sourceLineNo">839</span>        return rebalance();<a name="line.839"></a>
<span class="sourceLineNo">840</span>      }<a name="line.840"></a>
<span class="sourceLineNo">841</span>    }<a name="line.841"></a>
<span class="sourceLineNo">842</span><a name="line.842"></a>
<span class="sourceLineNo">843</span>    private void recomputeMultiset() {<a name="line.843"></a>
<span class="sourceLineNo">844</span>      this.distinctElements = 1 + TreeMultiset.distinctElements(left)<a name="line.844"></a>
<span class="sourceLineNo">845</span>          + TreeMultiset.distinctElements(right);<a name="line.845"></a>
<span class="sourceLineNo">846</span>      this.totalCount = elemCount + totalCount(left) + totalCount(right);<a name="line.846"></a>
<span class="sourceLineNo">847</span>    }<a name="line.847"></a>
<span class="sourceLineNo">848</span><a name="line.848"></a>
<span class="sourceLineNo">849</span>    private void recomputeHeight() {<a name="line.849"></a>
<span class="sourceLineNo">850</span>      this.height = 1 + Math.max(height(left), height(right));<a name="line.850"></a>
<span class="sourceLineNo">851</span>    }<a name="line.851"></a>
<span class="sourceLineNo">852</span><a name="line.852"></a>
<span class="sourceLineNo">853</span>    private void recompute() {<a name="line.853"></a>
<span class="sourceLineNo">854</span>      recomputeMultiset();<a name="line.854"></a>
<span class="sourceLineNo">855</span>      recomputeHeight();<a name="line.855"></a>
<span class="sourceLineNo">856</span>    }<a name="line.856"></a>
<span class="sourceLineNo">857</span><a name="line.857"></a>
<span class="sourceLineNo">858</span>    private AvlNode&lt;E&gt; rebalance() {<a name="line.858"></a>
<span class="sourceLineNo">859</span>      switch (balanceFactor()) {<a name="line.859"></a>
<span class="sourceLineNo">860</span>        case -2:<a name="line.860"></a>
<span class="sourceLineNo">861</span>          if (right.balanceFactor() &gt; 0) {<a name="line.861"></a>
<span class="sourceLineNo">862</span>            right = right.rotateRight();<a name="line.862"></a>
<span class="sourceLineNo">863</span>          }<a name="line.863"></a>
<span class="sourceLineNo">864</span>          return rotateLeft();<a name="line.864"></a>
<span class="sourceLineNo">865</span>        case 2:<a name="line.865"></a>
<span class="sourceLineNo">866</span>          if (left.balanceFactor() &lt; 0) {<a name="line.866"></a>
<span class="sourceLineNo">867</span>            left = left.rotateLeft();<a name="line.867"></a>
<span class="sourceLineNo">868</span>          }<a name="line.868"></a>
<span class="sourceLineNo">869</span>          return rotateRight();<a name="line.869"></a>
<span class="sourceLineNo">870</span>        default:<a name="line.870"></a>
<span class="sourceLineNo">871</span>          recomputeHeight();<a name="line.871"></a>
<span class="sourceLineNo">872</span>          return this;<a name="line.872"></a>
<span class="sourceLineNo">873</span>      }<a name="line.873"></a>
<span class="sourceLineNo">874</span>    }<a name="line.874"></a>
<span class="sourceLineNo">875</span><a name="line.875"></a>
<span class="sourceLineNo">876</span>    private int balanceFactor() {<a name="line.876"></a>
<span class="sourceLineNo">877</span>      return height(left) - height(right);<a name="line.877"></a>
<span class="sourceLineNo">878</span>    }<a name="line.878"></a>
<span class="sourceLineNo">879</span><a name="line.879"></a>
<span class="sourceLineNo">880</span>    private AvlNode&lt;E&gt; rotateLeft() {<a name="line.880"></a>
<span class="sourceLineNo">881</span>      checkState(right != null);<a name="line.881"></a>
<span class="sourceLineNo">882</span>      AvlNode&lt;E&gt; newTop = right;<a name="line.882"></a>
<span class="sourceLineNo">883</span>      this.right = newTop.left;<a name="line.883"></a>
<span class="sourceLineNo">884</span>      newTop.left = this;<a name="line.884"></a>
<span class="sourceLineNo">885</span>      newTop.totalCount = this.totalCount;<a name="line.885"></a>
<span class="sourceLineNo">886</span>      newTop.distinctElements = this.distinctElements;<a name="line.886"></a>
<span class="sourceLineNo">887</span>      this.recompute();<a name="line.887"></a>
<span class="sourceLineNo">888</span>      newTop.recomputeHeight();<a name="line.888"></a>
<span class="sourceLineNo">889</span>      return newTop;<a name="line.889"></a>
<span class="sourceLineNo">890</span>    }<a name="line.890"></a>
<span class="sourceLineNo">891</span><a name="line.891"></a>
<span class="sourceLineNo">892</span>    private AvlNode&lt;E&gt; rotateRight() {<a name="line.892"></a>
<span class="sourceLineNo">893</span>      checkState(left != null);<a name="line.893"></a>
<span class="sourceLineNo">894</span>      AvlNode&lt;E&gt; newTop = left;<a name="line.894"></a>
<span class="sourceLineNo">895</span>      this.left = newTop.right;<a name="line.895"></a>
<span class="sourceLineNo">896</span>      newTop.right = this;<a name="line.896"></a>
<span class="sourceLineNo">897</span>      newTop.totalCount = this.totalCount;<a name="line.897"></a>
<span class="sourceLineNo">898</span>      newTop.distinctElements = this.distinctElements;<a name="line.898"></a>
<span class="sourceLineNo">899</span>      this.recompute();<a name="line.899"></a>
<span class="sourceLineNo">900</span>      newTop.recomputeHeight();<a name="line.900"></a>
<span class="sourceLineNo">901</span>      return newTop;<a name="line.901"></a>
<span class="sourceLineNo">902</span>    }<a name="line.902"></a>
<span class="sourceLineNo">903</span><a name="line.903"></a>
<span class="sourceLineNo">904</span>    private static long totalCount(@Nullable AvlNode&lt;?&gt; node) {<a name="line.904"></a>
<span class="sourceLineNo">905</span>      return (node == null) ? 0 : node.totalCount;<a name="line.905"></a>
<span class="sourceLineNo">906</span>    }<a name="line.906"></a>
<span class="sourceLineNo">907</span><a name="line.907"></a>
<span class="sourceLineNo">908</span>    private static int height(@Nullable AvlNode&lt;?&gt; node) {<a name="line.908"></a>
<span class="sourceLineNo">909</span>      return (node == null) ? 0 : node.height;<a name="line.909"></a>
<span class="sourceLineNo">910</span>    }<a name="line.910"></a>
<span class="sourceLineNo">911</span><a name="line.911"></a>
<span class="sourceLineNo">912</span>    @Nullable private AvlNode&lt;E&gt; ceiling(Comparator&lt;? super E&gt; comparator, E e) {<a name="line.912"></a>
<span class="sourceLineNo">913</span>      int cmp = comparator.compare(e, elem);<a name="line.913"></a>
<span class="sourceLineNo">914</span>      if (cmp &lt; 0) {<a name="line.914"></a>
<span class="sourceLineNo">915</span>        return (left == null) ? this : Objects.firstNonNull(left.ceiling(comparator, e), this);<a name="line.915"></a>
<span class="sourceLineNo">916</span>      } else if (cmp == 0) {<a name="line.916"></a>
<span class="sourceLineNo">917</span>        return this;<a name="line.917"></a>
<span class="sourceLineNo">918</span>      } else {<a name="line.918"></a>
<span class="sourceLineNo">919</span>        return (right == null) ? null : right.ceiling(comparator, e);<a name="line.919"></a>
<span class="sourceLineNo">920</span>      }<a name="line.920"></a>
<span class="sourceLineNo">921</span>    }<a name="line.921"></a>
<span class="sourceLineNo">922</span><a name="line.922"></a>
<span class="sourceLineNo">923</span>    @Nullable private AvlNode&lt;E&gt; floor(Comparator&lt;? super E&gt; comparator, E e) {<a name="line.923"></a>
<span class="sourceLineNo">924</span>      int cmp = comparator.compare(e, elem);<a name="line.924"></a>
<span class="sourceLineNo">925</span>      if (cmp &gt; 0) {<a name="line.925"></a>
<span class="sourceLineNo">926</span>        return (right == null) ? this : Objects.firstNonNull(right.floor(comparator, e), this);<a name="line.926"></a>
<span class="sourceLineNo">927</span>      } else if (cmp == 0) {<a name="line.927"></a>
<span class="sourceLineNo">928</span>        return this;<a name="line.928"></a>
<span class="sourceLineNo">929</span>      } else {<a name="line.929"></a>
<span class="sourceLineNo">930</span>        return (left == null) ? null : left.floor(comparator, e);<a name="line.930"></a>
<span class="sourceLineNo">931</span>      }<a name="line.931"></a>
<span class="sourceLineNo">932</span>    }<a name="line.932"></a>
<span class="sourceLineNo">933</span><a name="line.933"></a>
<span class="sourceLineNo">934</span>    @Override<a name="line.934"></a>
<span class="sourceLineNo">935</span>    public E getElement() {<a name="line.935"></a>
<span class="sourceLineNo">936</span>      return elem;<a name="line.936"></a>
<span class="sourceLineNo">937</span>    }<a name="line.937"></a>
<span class="sourceLineNo">938</span><a name="line.938"></a>
<span class="sourceLineNo">939</span>    @Override<a name="line.939"></a>
<span class="sourceLineNo">940</span>    public int getCount() {<a name="line.940"></a>
<span class="sourceLineNo">941</span>      return elemCount;<a name="line.941"></a>
<span class="sourceLineNo">942</span>    }<a name="line.942"></a>
<span class="sourceLineNo">943</span><a name="line.943"></a>
<span class="sourceLineNo">944</span>    @Override<a name="line.944"></a>
<span class="sourceLineNo">945</span>    public String toString() {<a name="line.945"></a>
<span class="sourceLineNo">946</span>      return Multisets.immutableEntry(getElement(), getCount()).toString();<a name="line.946"></a>
<span class="sourceLineNo">947</span>    }<a name="line.947"></a>
<span class="sourceLineNo">948</span>  }<a name="line.948"></a>
<span class="sourceLineNo">949</span><a name="line.949"></a>
<span class="sourceLineNo">950</span>  private static &lt;T&gt; void successor(AvlNode&lt;T&gt; a, AvlNode&lt;T&gt; b) {<a name="line.950"></a>
<span class="sourceLineNo">951</span>    a.succ = b;<a name="line.951"></a>
<span class="sourceLineNo">952</span>    b.pred = a;<a name="line.952"></a>
<span class="sourceLineNo">953</span>  }<a name="line.953"></a>
<span class="sourceLineNo">954</span><a name="line.954"></a>
<span class="sourceLineNo">955</span>  private static &lt;T&gt; void successor(AvlNode&lt;T&gt; a, AvlNode&lt;T&gt; b, AvlNode&lt;T&gt; c) {<a name="line.955"></a>
<span class="sourceLineNo">956</span>    successor(a, b);<a name="line.956"></a>
<span class="sourceLineNo">957</span>    successor(b, c);<a name="line.957"></a>
<span class="sourceLineNo">958</span>  }<a name="line.958"></a>
<span class="sourceLineNo">959</span><a name="line.959"></a>
<span class="sourceLineNo">960</span>  /*<a name="line.960"></a>
<span class="sourceLineNo">961</span>   * TODO(jlevy): Decide whether entrySet() should return entries with an equals() method that<a name="line.961"></a>
<span class="sourceLineNo">962</span>   * calls the comparator to compare the two keys. If that change is made,<a name="line.962"></a>
<span class="sourceLineNo">963</span>   * AbstractMultiset.equals() can simply check whether two multisets have equal entry sets.<a name="line.963"></a>
<span class="sourceLineNo">964</span>   */<a name="line.964"></a>
<span class="sourceLineNo">965</span><a name="line.965"></a>
<span class="sourceLineNo">966</span>  /**<a name="line.966"></a>
<span class="sourceLineNo">967</span>   * @serialData the comparator, the number of distinct elements, the first element, its count, the<a name="line.967"></a>
<span class="sourceLineNo">968</span>   *             second element, its count, and so on<a name="line.968"></a>
<span class="sourceLineNo">969</span>   */<a name="line.969"></a>
<span class="sourceLineNo">970</span>  @GwtIncompatible("java.io.ObjectOutputStream")<a name="line.970"></a>
<span class="sourceLineNo">971</span>  private void writeObject(ObjectOutputStream stream) throws IOException {<a name="line.971"></a>
<span class="sourceLineNo">972</span>    stream.defaultWriteObject();<a name="line.972"></a>
<span class="sourceLineNo">973</span>    stream.writeObject(elementSet().comparator());<a name="line.973"></a>
<span class="sourceLineNo">974</span>    Serialization.writeMultiset(this, stream);<a name="line.974"></a>
<span class="sourceLineNo">975</span>  }<a name="line.975"></a>
<span class="sourceLineNo">976</span><a name="line.976"></a>
<span class="sourceLineNo">977</span>  @GwtIncompatible("java.io.ObjectInputStream")<a name="line.977"></a>
<span class="sourceLineNo">978</span>  private void readObject(ObjectInputStream stream) throws IOException, ClassNotFoundException {<a name="line.978"></a>
<span class="sourceLineNo">979</span>    stream.defaultReadObject();<a name="line.979"></a>
<span class="sourceLineNo">980</span>    @SuppressWarnings("unchecked")<a name="line.980"></a>
<span class="sourceLineNo">981</span>    // reading data stored by writeObject<a name="line.981"></a>
<span class="sourceLineNo">982</span>    Comparator&lt;? super E&gt; comparator = (Comparator&lt;? super E&gt;) stream.readObject();<a name="line.982"></a>
<span class="sourceLineNo">983</span>    Serialization.getFieldSetter(AbstractSortedMultiset.class, "comparator").set(this, comparator);<a name="line.983"></a>
<span class="sourceLineNo">984</span>    Serialization.getFieldSetter(TreeMultiset.class, "range").set(<a name="line.984"></a>
<span class="sourceLineNo">985</span>        this,<a name="line.985"></a>
<span class="sourceLineNo">986</span>        GeneralRange.all(comparator));<a name="line.986"></a>
<span class="sourceLineNo">987</span>    Serialization.getFieldSetter(TreeMultiset.class, "rootReference").set(<a name="line.987"></a>
<span class="sourceLineNo">988</span>        this,<a name="line.988"></a>
<span class="sourceLineNo">989</span>        new Reference&lt;AvlNode&lt;E&gt;&gt;());<a name="line.989"></a>
<span class="sourceLineNo">990</span>    AvlNode&lt;E&gt; header = new AvlNode&lt;E&gt;(null, 1);<a name="line.990"></a>
<span class="sourceLineNo">991</span>    Serialization.getFieldSetter(TreeMultiset.class, "header").set(this, header);<a name="line.991"></a>
<span class="sourceLineNo">992</span>    successor(header, header);<a name="line.992"></a>
<span class="sourceLineNo">993</span>    Serialization.populateMultiset(this, stream);<a name="line.993"></a>
<span class="sourceLineNo">994</span>  }<a name="line.994"></a>
<span class="sourceLineNo">995</span><a name="line.995"></a>
<span class="sourceLineNo">996</span>  @GwtIncompatible("not needed in emulated source") private static final long serialVersionUID = 1;<a name="line.996"></a>
<span class="sourceLineNo">997</span>}<a name="line.997"></a>




























































</pre>
</div>
</body>
</html>
